Kriesell, Matthias
(Cambridge : Cambridge University Press, 2005)
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in G are not k-connected, and let t(G) denote the number of triangles in G. Thomassen proved t(G) ≥ 1, which was later ...